Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
241	CS 373 Midterm 2 (April 3, 2001) Spring 2001 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 Network theory Adjacency matrix Algebraic graph theory Matrices Graph Adjacency list Shortest path problem Algorithm Connectivity Graph theory Mathematics Theoretical computer science
242	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area Fabrizio Frati∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:05 Graph drawing Outerplanar graph Graph operations Geometric graph theory Dual graph Graph Tree Binary tree Path decomposition Graph theory Planar graphs Topological graph theory
243	Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth Add to Reading List Source URL: jair.org Language: English - Date: 2012-03-19 16:09:33 Tree decomposition Interval graph Floyd–Warshall algorithm Neighbourhood Clique Split graph Shortest path problem Path decomposition Degeneracy Graph theory Graph operations Chordal graph
244	Computing the Shortest Path: A∗ Search Meets Graph Theory Andrew V. Goldberg∗ Abstract We propose shortest path algorithms that use A∗ search in combination with a new graph-theoretic lower-bounding technique based Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2011-10-12 13:22:52 Search algorithms Routing algorithms Network theory Shortest path problem Breadth-first search Distance Connected component Graph Algorithm Mathematics Graph theory Theoretical computer science
245	´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting: Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:20 Eulerian path Route inspection problem Graph Matching Line graph Hamiltonian path Graph theory Planar graphs NP-complete problems
246	CCCG 2011, Toronto ON, August 10–12, 2011 Rigid components in fixed-lattice and cone frameworks∗ Matthew Berardi† Brent Heeringa‡ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:14 Dense graph Minor Matroid theory Structural rigidity Shortest path problem Pseudoforest Edge coloring Graph theory Graph coloring Laman graph
247	Random Walks Based Modularity: Application to Semi-Supervised Learning Robin Devooght Amin Mantrach Add to Reading List Source URL: labs.yahoo.com Language: English - Date: 2014-11-12 10:09:07 Algebraic graph theory Theoretical computer science Networks Modularity Community structure Shortest path problem Random walk Adjacency matrix Matrix Graph theory Mathematics Network theory
248	EASE: An Effective 3-in-1 Keyword Search Method for Unstructured, Semi-structured and Structured Data Guoliang Li1 1 Beng Chin Ooi2 Add to Reading List Source URL: dbgroup.cs.tsinghua.edu.cn Language: English - Date: 2012-01-09 09:42:51 Shortest path problem Adjacency matrix Planar separator theorem Graph theory Mathematics Graph
249	ISSNGRACE TECHNICAL REPORTS Bidirectionalizing Structural Recursion on Graphs Add to Reading List Source URL: grace-center.jp Language: English - Date: 2015-02-10 03:40:06 Rooted graph Graph operations Matroid theory Median graph Path decomposition Graph theory Mathematics Graph rewriting
250	16th Canadian Conference on Computational Geometry, 2004 Approximating optimal paths in terrains with weight defined by a piecewise-linear function J. A. P´erez Ruy-D´ıaz Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Curves NP-complete problems Network theory Routing algorithms Steiner tree problem Shortest path problem A* search algorithm Catenary Graph Graph theory Mathematics Theoretical computer science